app(app(F, app(app(F, f), x)), x) → app(app(F, app(G, app(app(F, f), x))), app(f, x))
↳ QTRS
↳ DependencyPairsProof
app(app(F, app(app(F, f), x)), x) → app(app(F, app(G, app(app(F, f), x))), app(f, x))
APP(app(F, app(app(F, f), x)), x) → APP(F, app(G, app(app(F, f), x)))
APP(app(F, app(app(F, f), x)), x) → APP(app(F, app(G, app(app(F, f), x))), app(f, x))
APP(app(F, app(app(F, f), x)), x) → APP(f, x)
APP(app(F, app(app(F, f), x)), x) → APP(G, app(app(F, f), x))
app(app(F, app(app(F, f), x)), x) → app(app(F, app(G, app(app(F, f), x))), app(f, x))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
APP(app(F, app(app(F, f), x)), x) → APP(F, app(G, app(app(F, f), x)))
APP(app(F, app(app(F, f), x)), x) → APP(app(F, app(G, app(app(F, f), x))), app(f, x))
APP(app(F, app(app(F, f), x)), x) → APP(f, x)
APP(app(F, app(app(F, f), x)), x) → APP(G, app(app(F, f), x))
app(app(F, app(app(F, f), x)), x) → app(app(F, app(G, app(app(F, f), x))), app(f, x))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
APP(app(F, app(app(F, f), x)), x) → APP(f, x)
app(app(F, app(app(F, f), x)), x) → app(app(F, app(G, app(app(F, f), x))), app(f, x))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
APP(app(F, app(app(F, f), x)), x) → APP(f, x)
The value of delta used in the strict ordering is 576.
POL(APP(x1, x2)) = (4)x_1
POL(app(x1, x2)) = (4)x_1 + (2)x_2
POL(F) = 4
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
app(app(F, app(app(F, f), x)), x) → app(app(F, app(G, app(app(F, f), x))), app(f, x))